Dynamic Remapping
نویسنده
چکیده
3041. Mainen, Z. F., and Sejnowski, T. J., 1995, Reliability of spike timing in neocortical neurons, Science, 268:1503-1506. Senn, W., Markram, H., and Tsodyks, M., 2001, An algorithm for modifying neurotransmitter release probability based on preand postsynaptic spike timing. Neural. Computation, 13:35-67. Shadlen, M. N., and Movshon, J. A,, 1999, Synchrony unbound: A critical evaluation of the temporal binding hypothesis, Neuron, 24:67-77. Singer, W., 1999, Neuronal synchrony: A versatile code for the definition of relations? Neuron, 24:49-65. von der Malsburg, C., 1981, The Correlation Theory of Brain Function, MPI BiophysicalXhemistry, Internal Report 81-2, reprinted in Models of Neural Networks I1 (E. Domany, J. L. van Hemmen, and K. Schulten, Eds.), Berlin: Springer-Verlag, 1994, chap. 2, pp. 95-119. + von der Malsburg, C., 1985, Nervous structures with dynamical links, Ber. Bunsenges. Phys. Chem., 89:703-710. 368 Part IlI: Articles
منابع مشابه
Optimal Periodic Remapping of Bulk Synchronous Computations on Multiprogrammed Distributed Systems
For bulk synchronous computations that have nondeterministic behaviors, dynamic remapping is an effective approach to ensure parallel efficiency. There are two basic issues in remapping: when and how to remap. This paper presents a formal treatment of the first issue for dynamic computations with a priori known statistical behaviors. We have formulated the problem as two complement sequential s...
متن کاملOptimal periodic remapping of dynamic bulk synchronous computations
Dynamic remapping is critical to the performance of bulk synchronous computations that have non-deterministic behaviors because of the need of barrier synchronization between phases. There are two basic issues in remapping: when and how to remap. This paper presents a formal analysis of the issue of when to remap for dynamic computations with a priori known statistical behaviors, with an object...
متن کاملOptimal Dynamic Remapping of Parallel Computations
A large class of computations are characterized by a sequence of phases, with phase changes occurring unpredictably. We consider the decision problem regarding the remapping of workload to processors in a parallel computation when (i) Ihe uiility of remapping md the future behavior of the workload is uncertain, and (ii) phases exhibit stable execution requirements during a given phase, but requ...
متن کاملDynamic Remapping 1995
The term dynamic remapping has been used in many different ways, but one of the clearest formulations of this concept comes from the mental rotation studies by Georgopoulos et al. (1989; see also REACHING: CODING IN MOTOR CORTEX). In these experiments, monkeys were trained to move a joystick in the direction of a visual stimulus, or 90" counterclockwise from it. The brightness of the stimulus i...
متن کاملPeriodic Remapping of Non-Deterministic Bulk Synchronous Computations
Dynamic remapping is critical to the performance of bulk synchronous computations that have non-deterministic behaviors because of the need of barrier synchronization between phases. This paper presents a formal analysis of the issue of when to remap for dynamic computations with a priori known statistical behaviors, with an objective of finding optimal remapping frequencies for a given toleran...
متن کاملImage lightness rescaling using sigmoidal contrast enhancement functions
In color gamut mapping of pictorial images, the lightness rendition of the mapped images plays a major role in the quality of the final image. For color gamut mapping tasks, where the goal is to produce a match to the original scene, it is important to maintain the perceived lightness contrast of the original image. Typical lightness remapping functions such as linear compression, soft compress...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995